Constructing “non-Kerrness” on compact domains
نویسندگان
چکیده
Given a compact domain of a 3-dimensional hypersurface on a vacuum spacetime, a scalar (the “non-Kerrness”) is constructed by solving a Dirichlet problem for a second order elliptic system. If such scalar vanishes, and a set of conditions are satisfied at a point, then the domain of dependence of the compact domain is isometric to a portion of a member of the Kerr family of solutions to the Einstein field equations. This construction is expected to be of relevance in the analysis of numerical simulations of black hole spacetimes. PACS: 04.20.Ex, 04.20.Jb, 04.25.dg
منابع مشابه
Pullback D-attractors for non-autonomous partly dissipative reaction-diffusion equations in unbounded domains
At present paper, we establish the existence of pullback $mathcal{D}$-attractor for the process associated with non-autonomous partly dissipative reaction-diffusion equation in $L^2(mathbb{R}^n)times L^2(mathbb{R}^n)$. In order to do this, by energy equation method we show that the process, which possesses a pullback $mathcal{D}$-absorbing set, is pullback $widehat{D}_0$-asymptotically compact.
متن کاملConstructing optimal polynomial meshes on planar starlike domains
We construct polynomial norming meshes with optimal cardinality growth, on planar compact starlike domains that satisfy a Uniform Interior Ball Condition (UIBC). 2000 AMS subject classification: 41A10, 41A63, 65D05.
متن کاملDomains with Non-Compact Automorphism Group: A Survey
We survey results arising from the study of domains in Cn with non-compact automorphism group. Beginning with a well-known characterization of the unit ball, we develop ideas toward a consideration of weakly pseudoconvex (and even non-pseudoconvex) domains with particular emphasis on characterizations of (i) smoothly bounded domains with non-compact automorphism group and (ii) the Levi geometry...
متن کاملExtracting Computable Bounds (and Algorithms) from Classical Existence Proofs: Girard Domains Enable Us to Go Beyond Local Compactness
In classical mathematics, the existence of a solution is often proven indirectly, non-constructively, without an efficient method for constructing the corresponding object. In many cases, we can extract an algorithm from a classical proof: e.g., when an object is (non-constructively) proven to be unique in a locally compact space (or when there are two such objects with a known lower bound on t...
متن کاملFinitely Smooth Reinhardt Domains with Non-compact Automorphism Group
We give a complete description of bounded Reinhardt domains of finite boundary smoothness that have non-compact automorphism group. As part of this program, we show that the classification of domains with non-compact automorphism group and having only finite boundary smoothness is considerably more complicated than the classification of such domains that have infinitely smooth boundary. Let D ⊂...
متن کامل